Minimum spanning tree

Results: 280



#Item
101Vision / Spanning tree / Computer graphics / Segmentation / Minimum spanning tree / Market segmentation / Edge detection / Minimum spanning tree-based segmentation / Region growing / Image processing / Computer vision / Imaging

Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb Artificial Intelligence Lab, Massachusetts Institute of Technology Daniel P. Huttenlocher Computer Science Department, Cornell University

Add to Reading List

Source URL: cs.brown.edu

Language: English - Date: 2015-04-07 21:33:37
102NP-complete problems / Spanning tree / Steiner tree problem / NP-hard problems / Minimum spanning tree / Tree / Vertex cover / Rectilinear Steiner tree / Connectivity / Graph theory / Theoretical computer science / Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-15 18:22:15
103Spanning tree / Fault-tolerant computer systems / Analysis of algorithms / Self-stabilization / Minimum spanning tree / Algorithm / Time complexity / Bellman–Ford algorithm / Distributed computing / Theoretical computer science / Computational complexity theory / Mathematics

Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:47
104Applied mathematics / Minimum-weight triangulation / Minimum spanning tree / Dynamic programming / Time complexity / Delaunay triangulation / Point set triangulation / Triangulation / Theoretical computer science / Mathematics

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:37
105Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Planar graph / Polyhedron / Tree / Dodecahedron / Nearest neighbor graph / Graph theory / Mathematics / Theoretical computer science

Minimum Spanning Trees on Polyhedra Michael J. Spriggs J. Mark Keil Department of Computer Science

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 16:04:26
106NP-complete problems / Steiner tree problem / Minimum spanning tree / Eulerian path / Matching / Graph coloring / Tree / Connectivity / Matroid theory / Graph theory / Mathematics / Theoretical computer science

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ Joondong Kim∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:01:57
107NP-complete problems / Graph coloring / Edge coloring / Independent set / Dominating set / Combinatorial optimization / Search algorithms / Maximal independent set / Minimum spanning tree / Graph theory / Theoretical computer science / Mathematics

Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:46
108NP-complete problems / Combinatorial optimization / Graph connectivity / Matching / Steiner tree problem / Minimum spanning tree / Eulerian path / Route inspection problem / Cut / Graph theory / Theoretical computer science / Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:07:19
109Spanning tree / Steiner tree problem / Rectilinear Steiner tree / Minimum spanning tree / Steiner points / Tree / R-tree / Graph theory / Theoretical computer science / Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees Anna Lubiw∗ Mina Razaghpour†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:01:04
110Spanning tree / Network flow / Graph connectivity / Maximum flow problem / Randomized algorithm / Minimum spanning tree / Connectivity / Cut / SL / Theoretical computer science / Graph theory / Mathematics

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-31 22:48:01
UPDATE